Planning in Action Language BC while Learning Action Costs for Mobile Robots

نویسندگان

  • Piyush Khandelwal
  • Fangkai Yang
  • Matteo Leonetti
  • Vladimir Lifschitz
  • Peter Stone
چکیده

The action language BC provides an elegant way of formalizing dynamic domains which involve indirect effects of actions and recursively defined fluents. In complex robot task planning domains, it may be necessary for robots to plan with incomplete information, and reason about indirect or recursive action effects. In this paper, we demonstrate how BC can be used for robot task planning to solve these issues. Additionally, action costs are incorporated with planning to produce optimal plans, and we estimate these costs from experience making planning adaptive. This paper presents the first application of BC on a real robot in a realistic domain, which involves human-robot interaction for knowledge acquisition, optimal plan generation to minimize navigation time, and learning for adaptive planning.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mobile Robot Planning Using Action Language BC with an Abstraction Hierarchy

Planning in real-world environments can be challenging for intelligent robots due to incomplete domain knowledge that results from unpredictable domain dynamism, and due to lack of global observability. Action language BC can be used for planning by formalizing the preconditions and (direct and indirect) effects of actions, and is especially suited for planning in robotic domains by incorporati...

متن کامل

Planning in Answer Set Programming while Learning Action Costs for Mobile Robots

For mobile robots to perform complex missions, it may be necessary for them to plan with incomplete information and reason about the indirect effects of their actions. Answer Set Programming (ASP) provides an elegant way of formalizing domains which involve indirect effects of an action and recursively defined fluents. In this paper, we present an approach that uses ASP for robotic task plannin...

متن کامل

Long-Term vs. Greedy Action Planning for Color Learning on a Mobile Robot

A major challenge to the deployment of mobile robots is the ability to function autonomously, learning appropriate models for environmental features and adapting those models in response to environmental changes. This autonomous operation in turn requires autonomous selection/planning of an action sequence that facilitates learning and adaptation. Here we focus on color modeling/learning and an...

متن کامل

Efficient Symbolic Task Planning for Multiple Mobile Robots

Symbolic task planning enables a robot to make high-level decisions toward a complex goal by computing a sequence of actions with minimum expected costs. This thesis builds on a single-robot planning framework, and aims to address two issues: (1) lack of performance information in the selection of planners across different formalisms, and (2) time complexity of optimal planning for multiple mob...

متن کامل

Direct Optimal Motion Planning for Omni-directional Mobile Robots under Limitation on Velocity and Acceleration

This paper describes a low computational direct approach for optimal motion planning and obstacle avoidance of Omni-directional mobile robots within velocity and acceleration constraints on the robot motion. The main purpose of this problem is the minimization of a quadratic cost function while limitation on velocity and acceleration of robot is considered and collision with any obstacle in the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014